Grid based computation for multiple body simulation.

ABSTRACT

A method and a corresponding software and a system for processing a charge distribution according to a spreading function and a predefined operation are described.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims priority under 35 U.S.C. §119 to U.S. Provisional Patent Application Ser. No. 60/584,032, filed Jun. 30, 2004, and entitled “ORTHOGONAL METHOD” and to U.S. Provisional Patent Application Ser. No. 60/584,000, filed Jun. 30, 2004, and entitled “MULTIPLE BODY SIMULATION”, the entire contents of which are hereby incorporated by reference.

This application is related to U.S. patent application Ser. No. 11/171,619 filed on Jun. 30, 2005 and to International Patent Application PCT/US05/23184 filed on Jun. 30, 2005.

TECHNICAL FIELD

This invention relates to simulation of multiple-body interactions.

BACKGROUND

Simulation of multiple-body interactions (often called “N-body” problems) are useful in a number of problem areas including celestial dynamics and computational chemistry. Biomolecular or electrostatic particle interaction simulations complement experiments by providing a uniquely detailed picture of the interactions between particles in a system. An important issue in simulations is the simulation speed.

Determining the interaction between all pairs of bodies in the system by enumerating the pairs can be computationally intensive, and thus, alternate interaction schemes are often used. For example, all particles within a predefined radius of a particular particle are interacted with that particle while particles farther away are ignored.

In some simulation schemes an Ewald method is used, which can reduce the amount of computation as opposed to enumeration of all potentially interacting pairs of bodies. For simulation of electrostatic systems, the Ewald method divides the electrostatic potential defined as a function of location into two main terms. A “screening” charge distribution, typically chosen to be Gaussian, is (notionally) centered on every point charge. This screening charge distribution is chosen to give the same charge magnitude but with opposite sign as the point charge on which it is centered. The electrostatic potential due to the combination of the point charge and the screening charge falls off rapidly with distance. Thus, this first contribution to the electrostatic potential can be neglected beyond a relatively small cut-off distance. The second contribution to the electrostatic potential is due to the negative of the contribution of all the screening charge distributions alone, essentially compensating for their introduction in the first term. This second contribution can be obtained by solving the Poisson equation for the charge distribution given by the sum of screening charge distributions.

SUMMARY

In one aspect, the invention includes a method and corresponding software and a system for processing a charge distribution according to a spreading function and a predefined operation. The spreading function is representable as a convolution of a first spreading function and a second spreading function, in which the first spreading function is different than the second spreading function. The processing of the charge distribution includes applying the first spreading function in a real domain to determine charge values at locations on the a grid from the charge distribution. The processing also includes applying the operation on the grid in the real domain and applying the second spreading function to the result of applying the operation.

Embodiments of the invention can include one or more of the following.

The spreading function can be mathematically represented by a variety of analytic functions. For example, the spreading function can be a Gaussian function, a polynomial function, an exponential function, a piecewise function, and the like.

The charge distribution can include a set of point charges. Each point charge of the set of point charges can have associated charge value (qi) and an associated location (ri). At least some of the associated locations (ri) can be locations not on the grid.

Applying the first spreading function in the real domain to determine charge values at locations on the grid from the charge distribution can include convolving a distribution representing the set of point charges with the first spreading function. Convolving a distribution representing the set of point charges with a first spreading function can include computing a distribution according to ρ(r){circle around (×)}S(r), where ρ(r) represents the charge distribution and S(r) represents the first spreading function. Convolving a distribution representing the set of point charges with the first spreading function can include, for each point charge, spreading a charge associated with the point charge to a set of nearby grid locations.

Applying the operation on the grid in the real domain can include computing a potential function. Computing the potential function can include computing a potential value at at least some of the grid locations. The operation can include a convolution, for example, a convolution with a 1/r function. The operation can include a solution of a Poisson function. The operation can include a convolution with a third portion of the spreading function. A specific application of the operation can include computing a potential according to φ*(r)=ρ^(s)(r){circle around (×)}γ(r) where ρ^(s)(r) depends on the charge distribution as well as the first spreading function and γ(r) is an operator. The operator, γ(r), can include a 1/r function.

Applying the second spreading function to the result of applying the operation can generate at least some force terms. At least some of the force terms can be associated with non-grid locations. The charge distribution can include a set of point charges at non-grid locations (ri) and at least some of the force terms associated with non-grid locations can be associated with the non-grid locations (ri) associated with the point charges. Applying the second spreading function to the result of applying the operation can include applying a spatial derivative to the result of applying the function.

Applying the second spreading function to the result of applying the operation can include evaluating a spatial derivative at grid locations. Evaluating the spatial derivative can include applying the spatial derivative to the result of applying the operation on the grid.

Applying the second spreading function to the result of applying the operation can include computing a potential energy. Applying the second spreading function to the result of applying the operation can include computing force values at locations off the grid based on values at the grid locations.

The real domain can be a real spatial domain.

Applying the first spreading function can include splitting the first spreading function into a first portion and a second portion, and applying the first spreading function can include applying the first portion to determine charge values at grid locations and applying the second portion to the values at the grid locations. The second portion can be implemented as a separable function. Splitting the first spreading function into the first portion and the second portion can be selected based on computational factors, such as computational complexity. The first portion can be equal to the second portion. In the alternative, the first portion can be unequal to the second portion. For example, the first portion can be smaller than the second portion. The first portion can be selected to include at least a minimum amount of the first spreading function needed to maintain an accuracy level for a force calculation or the first portion can be selected to be a larger portion of the first spreading function than needed to maintain an accuracy level for a force calculation.

The first spreading function, the second spreading, or both can be Gaussian functions. If both the first spreading function and the second spreading function are Gaussian functions, the Gaussian functions can have different variances.

The charge distribution can include a charge distribution for a molecule or system of molecules, such as a protein or a protein in a solution.

In another aspect, the invention can include a method and a corresponding software and a system for processing a charge distribution according to a spreading function and a predefined operation. The spreading function is representable as a convolution of a first spreading function and a second spreading function. The first spreading function can be represented in two portions, the second portion being a separable function. The method can also include applying the first portion of the first spreading function in a real domain to determine charge values at locations on the grid from the charge distribution, applying a second portion of the first spreading function in the real domain, and applying an operation in the real domain on the grid.

Embodiments of the invention can include one or more of the following.

The method can also include applying the second spreading function to the result of applying the operation.

The spreading function can be mathematically represented by a variety of analytic functions. For example, the spreading function can be a Gaussian function, a polynomial function, an exponential function, a piecewise function, and the like.

The charge distribution can include a set of point charges. Each point charge in the set of point charges can have an associated charge value (qi) and an associated location (ri). At least some of the associated locations (ri) can be locations not on the grid.

Applying the first portion of the first spreading function in the real domain to determine charge values at locations on the grid from the charge distribution can include convolving a distribution representing the set of point charges with the first portion of the first spreading function. Convolving the distribution representing the set of point charges with the first portion of the first spreading function can include computing a distribution according to ρ(r){circle around (×)}S(r) where ρ(r) includes the charge distribution and S(r) includes the first portion of the first spreading function. Convolving a distribution representing the set of point charges with the first portion of the first spreading function can include, for each point charge, spreading a charge associated with the point charge to a set of nearby nodes or the gird. Applying the second portion of the first spreading function in the real domain can include applying the second portion of the first spreading function as a separable function. Applying the second potion of the first spreading function in the real domain can include implementing a discrete space convolution. Applying the second portion of the first spreading function can spread charges over the grid locations.

Applying the operation on the grid in the real domain can include computing a potential function. Computing a potential function can include computing a potential function at the grid locations. The operation can include a convolution, for example, a convolution with a 1/r function. In another example, the operation can include a solution of a Poisson function. In another example, the operation can include a convolution with the second portion of the first spreading function. A specific application of the operation can include computing a potential according to φ*(r)=ρ^(s)(r){circle around (×)}γ(r) where ρ^(s)(r) depends on the charge distribution as well as the first spreading function and γ(r) is an operator. The operator, γ(r), can include a 1/r function.

Applying the second spreading function to the result of applying the operation can generate at least some force terms. At least some of the force terms can be associated with non-grid locations. Alternately, or in addition other force terms can be associated with grid locations. The charge distribution can include a set of point charges at non-grid locations (ri) and the force terms at non-grid locations can be at the non-grid locations (ri) associated with the point charges. Applying the second spreading function to the result of applying the operation can include calculating a spatial derivative at grid locations. Evaluating the spatial derivative can include applying the spatial derivative to the result of applying the operation on the grid. The real domain can be a real spatial domain. Applying the second spreading function can include computing force values at locations off the grid based on values at the grid locations.

The first spreading function can be represented as a different distribution than the second spreading function. The first spreading function and/or the second spreading function can be Gaussian functions. For example, the first spreading function and the second spreading function can both be Gaussian functions each having a different variance. The first portion can be equal to the second portion. Alternately, the first portion can be unequal to the second portion. For example, the first portion can be smaller than the second portion. The first portion can include at least a minimum amount of the first spreading function needed to maintain an accuracy level.

Applying an operation in the real domain on the grid can include solving Poisson's equation. Solving Poisson's equation can include iteratively solving Poisson's equation. The charge distribution can include a charge distribution for a molecule or system of molecules, such as a protein or a protein in a solution.

In another aspect, the invention can include a method for molecular simulation or modeling, such as protein simulation, that includes computing force or charge on particles in a molecule. Computing the forces can include processing a charge distribution as described herein.

In another aspect, the invention can include a method for molecular simulation or modeling, such as protein simulation, that includes the application of an Ewald method and includes processing a charge distribution as described herein.

In another aspect, the invention can include a method for molecular simulation or modeling, such as protein simulation, that includes the application of a direct enumeration of pairs as described herein and also includes processing a charge distribution according to one or more of the methods described herein.

In another aspect, the invention can include a method and a corresponding software and a system for processing a charge distribution according to a Gaussian spreading function. The Gaussian spreading function can be a convolution of components. The processing can include spreading charges to the grid in a first domain based on a first component of the Gaussian spreading function. The processing can also include applying a function to the charges on the grid in a second domain using a second component of the Gaussian spreading function and performing a calculation based on a third component of the Gaussian spreading function and the result of applying the function.

Embodiments of the invention can include one or more of the following.

The spreading function can alternately be mathematically represented by a variety of analytic functions. For example, the spreading function can be a non-Gaussian function such as a polynomial function, an exponential function, a piecewise function, and the like.

The charge distribution can include a set of point charges. Each point charge included in the set of point charges can have an associated charge value (qi) and an associated location (ri). At least some of the associated locations (ri) can be locations not on the grid.

Spreading the charges to the grid can include convolving a distribution representing the set of point charges with the first component of the spreading function. Convolving a distribution representing the set of point charges with the first component of the spreading function can include computing a distribution according to ρ(r){circle around (×)}S(r) where ρ(r) represents the charge distribution and S(r) represents the first component of the spreading function. Convolving a distribution representing the set of point charges with the first component of the spreading function can include, for each point charge, spreading the charge to a set of nearby grid locations.

Applying the function to the charges on the grid in a second domain can include applying the second component of the spreading function as a separable function. Applying the second component can include implementing a discrete space convolution. Applying the function to the charges on the grid can spread charges over the grid locations. Applying the function to the charges on the grid in the second domain can include computing a potential function. Computing the potential function can include computing the potential function at the grid locations. A specific application of the operation can include computing a potential according to φ*(r)=ρ^(s)(r){circle around (×)}γ(r) where ρ^(s)(r) depends on the charge distribution as well as the first spreading function and γ(r) is an operator. The operator, γ(r), can include a 1/r function.

The operation can include a convolution, for example, a convolution with a 1/r function. In another example, the operation can include a solution of a Poisson function. In another example, the operation can include a convolution with a second portion of the first spreading function.

Performing the calculation based on a third component of the Gaussian spreading function and the result of applying the function can generate at least some force terms. At least some of the force terms can be associated with non-grid locations. In some embodiments, the charge distribution can include a set of point charges at non-grid locations (ri) and the force terms at non-grid locations are at the non-grid locations (ri) associated with the point charges.

Applying the second spreading function to the result of applying the operation can include evaluating a spatial derivative at grid locations. Evaluating the spatial derivative can include applying the spatial derivative to the result of applying the operation on the grid.

Performing the calculation based on a third component and the result of applying the function can include implementing a convolution of the result with the third component.

The first component of the Gaussian spreading function, the second portion of the Gaussian spreading function and the third portion of the Gaussian spreading function can each represent different Gaussian distributions. The first domain can be a real domain. The second domain can be an FFT domain.

Applying the function to the charges on the grid in the second domain using the second component of the Gaussian spreading function can include convolving the function with the second portion of the Gaussian spreading function. Convolving the function with the second portion of the Gaussian spreading function can include multiplying the function with the second portion of the Gaussian spreading function in the FFT domain. Performing the calculation can include calculating a force.

The charge distribution can include a charge distribution for a molecule or system of molecules, such as a protein or a protein in a solution.

In another aspect, the invention includes a method and a corresponding software and a system for selecting a first distribution, a second distribution, and a third distribution such that a convolution of the first distribution, the second distribution, and the third distribution is equal to a predefined spreading function. The method can also include determining forces on a particle associated with charges based on applying the first distribution and the second distribution in a first computational domain and applying the third distribution in a second computational domain. The spreading function can be mathematically represented by a variety of analytic functions.

Embodiments of the invention can include one or more of the following.

The spreading function can be a Gaussian function, a polynomial function, an exponential function, a piecewise function, and the like. Determining forces on the particle associated with the charges can include computing charge values at grid locations. Determining forces on the particle associated with the charges can include computing potentials at non-grid locations. In another embodiment, determining forces on the particle associated with the charges can include computing force terms at grid locations.

Applying the third distribution can include applying the third distribution in combination with an operation to the spread charge. The first distribution, the second distribution, and the third distribution can be Gaussian functions. Alternately, the first distribution, the second distribution, and the third distribution can be non-Gaussian functions such as polynomials, exponentials, or other functions. Selecting the distributions can include selecting the first distribution, the second distribution, and the third distribution based on an acceptable amount of error.

The operation can include, for example, a convolution with a 1/r function or a solution of a Poisson function. Applying the first distribution and the second distribution in a first computational domain can include convolving at least one of the first distribution and the second distribution with the charge distribution. Applying the third distribution in a second computational domain can include convolving the third distribution with a set of charges located at grid locations. The first domain can be a real domain and/or the second domain can be an FFT domain.

The Gaussian split Ewald (GSE) method provides a method for determining the interaction between two particles in a system that is fast when combined with a real space solution of Poisson's equation.

In a system, screening charge distributions that span many mesh points and methods to solve for the interaction and forces on a particle require a large number of grid operations per atom or particle in the system. In order to reduce the amount of calculation needed to determine the forces on a particle, the GSE method provides a two-stage approach. In the two-stage approach, a particle's charge is first spread to a small number of mesh points that lie within a restricted neighborhood of the particle. The additional broadening or spreading can be obtained in a second stage by a convolution operation. The convolution provides an advantage in the calculation time because when performed in reciprocal space the convolution does not add significant calculation time. In the GSE method, the Guassian function is divided between multiple portions of the overall calculation. Tuning the ratio between the portions of the Gaussian provides the advantage of allowing the computational load to be shifted away from the charge-spreading and interpolation steps to the highly efficient second charge spreading step. This takes advantage of the fact that an on-grid convolution with a Gaussian is less computationally intensive than other comparable methods.

In some examples, the Ewald mesh method may be combined with a real-space Poisson solver. The charge spreading and force calculation steps may be performed with a computational burden similar to that of efficient FFT-based approaches. Additional advantages are related to the reuse of the charge-spreading and force calculation algorithms in combination with a reciprocal space solution of the Poisson equation to give an Ewald method (k-GSE) that is conceptually simpler (and easier to implement) than the other methods without sacrificing performance.

The systems and methods described herein may have advantages for the simulation and modeling of a protein or proteins in a solution (e.g., a solvent). A protein in a solution can, for example, be amenable to periodic boundary conditions. In addition, such a system can provide a relatively uniform distribution of bodies to nodes within the system. For example, each node can include at least some bodies.

The details of one or more embodiments of the invention are set forth in the accompanying drawings and the description below. Other features, objects, and advantages of the invention will be apparent from the description and drawings, and from the claims.

DESCRIPTION OF DRAWINGS

FIG. 1 is a block diagram.

FIGS. 2 and 3 are diagrams with a derivation of forces.

FIG. 4 is a diagram illustrating an Ewald decomposition.

FIGS. 5 and 6 are diagrams with equations related to an Ewald decomposition.

FIGS. 7A-7C are diagrams illustrating a mesh Ewald approach.

FIG. 8 is a flow chart.

FIG. 9 is a flow chart.

FIG. 10 is a flow chart.

FIG. 11 is block diagram.

FIG. 12 is block diagram.

FIG. 13 is block diagram.

FIG. 14 is a flow chart.

FIG. 15 is block diagram.

FIG. 16 is block diagram.

FIG. 17 is a flow chart.

DETAILED DESCRIPTION

Referring to FIG. 1, N point charges 14 {q_(i)} at positions {r_(i)} are located in a cubic volume 11 of side length (L) 12. The system is assumed to be neutral, i.e.

${\sum\limits_{i = 1}^{N}q_{i}} = 0.$ In order to avoid modeling discontinuities at the boundaries of the cubic volume, periodic boundary conditions are imposed such that copies of the original system (which we term boxes, the original being the “primary box” 11) tile an infinite space 10 in a cubic lattice so that particle i and its images 15 lie at r_(i)+nL, where n=(n_(x), n_(y), n_(z)), with n_(α)=0, ±1, ±2, . . . , ±∞ (α=x, y, or z). The assumption of cubic boxes is made to simplify the exposition; however, the method can be extended to other box geometries.

Referring to FIG. 2, one approach to computing the (vector) force on each particle is to first compute the total electrostatic potential energy E, per box, (eq. 22). The force on the i^(th) particle in the box, F_(i), is then computed using the partial derivative of the potential energy with respect to perturbation of the location, r_(i), of that particle (eq. 26).

The total electrostatic energy per box in units where 4πε₀=1 is

$\begin{matrix} {E = {\frac{1}{2}{\sum\limits_{i,{j = 1}}^{N}{\overset{\prime}{\sum\limits_{n}}{\frac{q_{i}q_{j}}{{r_{i} - r_{j} - {nL}}}.}}}}} & (1) \end{matrix}$ where the prime in the summation indicates that terms which simultaneously satisfy n=0 and i=j are omitted from the sum. The most straightforward method of evaluating equation (1) and the corresponding forces is a straight cut-off method, i.e. to simply ignore terms in the sum with |r_(i)−r_(j)−nL| greater than a cut-off distance. Unfortunately, the slow decay of the Coulomb potential can lead to artifacts in dynamical simulations, at least for cut-off radii small enough to allow rapid computation of the sum.

Ewald Sum

An alternative method for evaluating Equation (1) is the method of Ewald as described below.

The summation of Equation (1) is only conditionally convergent so strictly speaking we should start by defining exactly what we mean by it, for example by including a convergence factor. A concise and transparent description is given to follow. The summation of Equation (1) may be equivalently written as

$\begin{matrix} {E = {\frac{1}{2}{\sum\limits_{i = 1}^{N}{{\phi_{i}(r)}q_{i}}}}} & (2) \end{matrix}$

where by definition

$\begin{matrix} {{\phi_{i}\left( r_{i} \right)} = {\sum\limits_{j = 1}^{N}{\overset{\prime}{\sum\limits_{n}}\frac{q_{j}}{{r_{i} - r_{j} - {nL}}}}}} & (3) \end{matrix}$

is the electrostatic potential due to all charges at r_(i) (omitting the charge at r_(i) itself, as indicated by the prime on the sum). The charge distribution (over the complete volume) is simply a sum of delta functions,

$\begin{matrix} {{{\rho(r)} = {\sum\limits_{i = 1}^{N}{\sum\limits_{n}{q_{i}{\delta\left( {r - r_{i} - {nL}} \right)}}}}},} & (4) \end{matrix}$

and φ_(i)(r_(i)) may be written in terms of the charge distribution as

$\begin{matrix} {{{\phi_{i}\left( r_{i} \right)} = {\int_{- \infty}^{\infty}{\frac{{\rho(r)} - {\rho_{i}(r)}}{{r_{i} - r}}{\mathbb{d}^{3}r}}}},} & (5) \end{matrix}$

where ρ_(i)(r)=q_(i)δ((r−r_(i)) is introduced to avoid including self-interaction of the i^(th) particle.

Referring to FIGS. 3 and 4, the Ewald decomposition may be considered to arise from adding and subtracting a screening charge distribution to the numerator of Equation (5), reproduced in FIG. 3 as equation (28). The screening charge distribution is defined as to be −ρ_(σ)(r) where we define

$\begin{matrix} {{\rho_{\sigma}(r)} = {\sum\limits_{i = 1}^{N}{\sum\limits_{n}{{q_{i}\left( \frac{1}{2{\pi\sigma}^{2}} \right)}^{3/2}{\exp\left( {{{- {{r - r_{i} - {nL}}}^{2}}/2}\sigma^{2}} \right)}}}}} & (6) \end{matrix}$

to be the “spread charge distribution” since it is simply the original charge distribution with the point charges spread into Gaussian charge distributions. We also define

${{\rho_{i\;\sigma}(r)} = {{q_{i}\left( \frac{1}{2{\pi\sigma}^{2}} \right)}^{3/2}{\exp\left( {{{- {{r - r_{i}}}^{2}}/2}\sigma^{2}} \right)}}},$ analogously to the definition of ρ_(i)(r) above. Shapes other than Gaussians can alternately be used, however, the description will focus on the Gaussian form.

Referring to FIG. 4, the initial point charge distribution ρ(r) (C1) includes impulses at the charge locations {r_(i)}, illustrated in FIG. 4 in one dimension for simplicity of presentation but representing the three-dimensional characteristics. The spread distribution ρ_(σ)(r) (42) is the sum of the components ρ_(iσ)(r) and their periodic copies, each of which has a Gaussian form.

The distribution ρ(r)−ρ_(i)(r), which is essentially the impulses shown in (40) omitting the impulse at r_(i), is decomposed into a sum of three terms:

-   -   −ρ_(iσ)(r), illustrated as (46);     -   {ρ(r)−ρ_(i)(r)}−{ρ_(σ)(r)−ρ_(iσ)(r)}, illustrated as (48); and     -   ρ_(σ)(r) itself, illustrated as (42).

Referring back to FIG. 3, the integral

${\phi_{i}\left( r_{i} \right)} = {\int_{- \infty}^{\infty}{\frac{{\rho(r)} - {\rho_{i}(r)}}{{r_{i} - r}}{\mathbb{d}^{3}r}}}$ (28) is decomposed into a sum of three integrals (30 a, 30 b and 30 c) corresponding to the three terms, which result in three terms (32 a, 32 b, and 32 c). The electrostatic potential can therefore be rewritten as φ_(i)(r _(i))=φ_(i) ^(self)+φ_(i) ^(dir)(r _(i))+φ_(σ)(r _(i)),  (7)

where the first term arises to cancel self-interactions present in the third term and it is given by

$\begin{matrix} {\phi_{i}^{self} = {{\int_{- \infty}^{\infty}{\frac{- {\rho_{i\;\sigma}(r)}}{{r_{i} - r}}{\mathbb{d}^{3}r}}} = {{- q_{i}}{\sqrt{\frac{2}{{\pi\sigma}^{2}}}.}}}} & (8) \end{matrix}$

The second term is the direct contribution, which arises from the screened charge distribution,

$\begin{matrix} \begin{matrix} {{\phi_{i}^{dir}\left( r_{i} \right)} = {\int_{- \infty}^{\infty}{\frac{\left\{ {{\rho(r)} - {\rho_{i}(r)}} \right\} - \left\{ {{\rho_{\sigma}(r)} - {\rho_{i\;\sigma}(r)}} \right\}}{{r_{i} - r}}{\mathbb{d}^{3}r}}}} \\ {= {\sum\limits_{j = 1}^{N}{q_{j}{\overset{\prime}{\sum\limits_{n}}\frac{{erfc}\left( {{{{r_{i} - r_{j} - {nL}}}/\sqrt{2}}\sigma} \right)}{{r_{i} - r_{j} - {nL}}}}}}} \end{matrix} & (9) \end{matrix}$

where erfc denotes the complementary error function, and the second equality in equation (9) follows after some algebra. Since

${{erfc}(x)} = {\frac{2}{\sqrt{\pi}}{\int_{x}^{\infty}{{\mathbb{e}}^{- t^{2}}{\mathbb{d}t}}}}$ decays rapidly with x, terms with |r_(i)−r_(j)−nL| larger than some cut-off value [to be determined by σ and the accuracy requirement] may be safely omitted from the sum, which may thus be evaluated as a direct sum in real space. The third term is the long range contribution,

$\begin{matrix} {{\phi_{\sigma}\left( r_{i} \right)} = {\int_{- \infty}^{\infty}{\frac{\rho_{\sigma}(r)}{{r_{i} - r}}{{\mathbb{d}^{3}r}.}}}} & (10) \end{matrix}$

Referring to FIG. 5, using equations (2) and (7), the total energy may likewise be split into three terms (54 a, 54 b, and 54 c),

$\begin{matrix} {E = {\frac{- {\sum\limits_{i = 1}^{N}q_{i}^{2}}}{\sqrt{2{\pi\sigma}^{2}}} + {\frac{1}{2}{\sum\limits_{i,{j = 1}}^{N}{\overset{\prime}{\sum\limits_{n}}\frac{q_{i}q_{j}{{erfc}\left( {{{{r_{i} - r_{j} - {nL}}}/\sqrt{2}}\sigma} \right)}}{{r_{i} - r_{j} - {nL}}}}}} + {\frac{1}{2}{\sum\limits_{i = 1}^{N}{{\phi_{\sigma}\left( r_{i} \right)}q_{i}}}}}} & (11) \end{matrix}$

corresponding to self-interaction correction, direct sum and long-range contributions, respectively. The direct sum term is computed through direct enumeration of the interacting pairs. Various techniques can be used to evaluate this enumerated sum, including an “orthogonal method” that is described later in this document.

Although all three contributions to the electrostatic potential depend on σ, we have chosen to denote the long-range potential φ_(σ)(r) to emphasize its connection to the smoothly varying spread charge distribution ρ_(σ)(r) through the Poisson equation ∇²φ_(σ)=−4πρ_(σ), the formal solution of which is Equation (10). Since ρ_(σ)(r) is smoothly varying for all r, it can be represented in reciprocal (transform) space with a finite number of wave-number terms, or on a grid in real-space. The actual value of the grid spacing (or number of k-space terms) depends on both the overall accuracy required, and the value of σ. For fixed accuracy requirements, larger values of σ require larger cut-offs in the direct sum, but allow ρ_(σ)(r) to be represented on a coarser grid (or with fewer k-space terms). Tuning σ therefore allows weight to be shifted between the direct and reciprocal summations, and σ is normally chosen to minimize the cost of the total computation. The calculation of the long-range contribution to the potential and the corresponding contributions to the energy and forces are discussed below.

Reformulation of Reciprocal Sum with Convolutions

The third term of the Ewald energy term is referred to as the “reciprocal sum” term:

$E_{\sigma} = {{\frac{1}{2}{\sum\limits_{i = 1}^{N}{q_{i}{\phi_{\sigma}\left( r_{i} \right)}\mspace{14mu}{where}\mspace{14mu}{\phi_{\sigma}\left( r_{i} \right)}}}} = {\int{\frac{\rho_{\sigma}(r)}{{r - r_{i}}}{\mathbb{d}r}}}}$

This term can be formulated in terms of convolutions allowing the establishment of relations (and a notation) useful in the discussion below related to mesh operations. A convolution of two real space quantities is denoted by the symbol {circle around (×)},

$\begin{matrix} {{A \otimes B} = {\int_{- \infty}^{\infty}{{A\left( {r - r^{\prime}} \right)}{B\left( r^{\prime} \right)}{{\mathbb{d}^{3}r^{\prime}}.}}}} & (12) \end{matrix}$

In the reciprocal (transform) space, convolution becomes multiplication, therefore, if A{circle around (×)}B=C then Ã{tilde over (B)}={tilde over (C)}, where we use the tilde to denote reciprocal space quantities,

${\overset{\sim}{A}(k)} = {\int_{- \infty}^{\infty}{{A(r)}{\mathbb{e}}^{{- {ik}} \cdot r}{{\mathbb{d}^{3}r}.}}}$

Defining γ(r)=1/r and denoting the normalized Gaussian G_(σ)(r)=(2πσ²)^(−3/2) exp(−r²/2σ²), we will need {tilde over (γ)}=4π/k ² and {tilde over (G)} _(σ)=exp(−σ² k ²/2),  (13)

where k=|k| and r=|r|. The Fourier coefficients of periodic quantities (i.e. quantities that are identical in every box such as the charge density) are denoted with a subscript wavevector rather than an argument, so by definition

${{\overset{\sim}{A}}_{k} = {\frac{1}{V}{\int_{V}{{A(r)}{\mathbb{e}}^{{- {ik}} \cdot r}{\mathbb{d}^{3}r}}}}},$ where

∫_(V) 𝕕³r denotes an integral over the primary box of volume V=L³. In particular, the Fourier representation of the original point charge density (the structure factor) is

$\begin{matrix} {{\overset{\sim}{\rho}}_{k} = {\frac{1}{V}{\sum\limits_{i = 1}^{N}{q_{i}{{\mathbb{e}}^{{- {ik}} \cdot r_{i}}.}}}}} & (14) \end{matrix}$

It is also convenient to define the operation · between two periodic quantities as

$\begin{matrix} {{A \cdot B} = {{\int_{A}{{A(r)}{B(r)}{\mathbb{d}^{3}r}}} = {V{\sum\limits_{k}{{\overset{\sim}{A}}_{k}{\overset{\sim}{B}}_{- k}}}}}} & (15) \end{matrix}$

where k=2πn/L, and each of the three components of n runs over all integers. It follows from these definitions that if B is an even function (like γ or G_(σ)) and A and C are periodic (like ρ or ρ_(σ)) then A·(B{circle around (×)}C)=(A{circle around (×)}B)·C.  (16)

It is convenient to write the reciprocal Ewald sum using the notation defined above.

Referring to FIG. 6 (equations 60, 62, 64), ρ_(σ) is ρ convolved with a normalized Gaussian of standard deviation σ: ρ_(σ) =ρ{circle around (×)}G _(σ).

The long-range contribution to the electrostatic potential is (from equation (5)) the charge density ρ_(σ) convolved with the Green function γ=1/r, φ_(σ)=ρ_(σ) {circle around (×)}γ=ρ{circle around (×)}G _(σ){circle around (×)}γ,  (17)

which is simply the formal solution to the Poisson equation for the spread charge distribution.

Referring to equations 66 in FIG. 6, the reciprocal sum contribution to the energy is given by

$\begin{matrix} {E_{\sigma} = {{\frac{1}{2}{\rho \cdot \phi_{\sigma}}} = {\frac{1}{2}{\rho \cdot {\left( {\rho \otimes G_{\sigma} \otimes \gamma} \right).}}}}} & (18) \end{matrix}$

Referring to equations 66, 67 and 68 in FIG. 6, if two quantities σ_(A) and σ_(B) are chosen such that σ_(A) ²+σ_(B) ²=σ² (and therefore G_(σ) _(A) {circle around (×)}G_(σ) _(B) =G_(σ)), using Equation (16) the energy can be rewritten by substitution and reordering terms as

$\begin{matrix} \begin{matrix} {E_{\sigma} = {\frac{1}{2}{\left( {\rho \otimes G_{\sigma_{A}}} \right) \cdot \left( {\rho \otimes G_{\sigma_{B}} \otimes \gamma} \right)}}} \\ {= {{\frac{1}{2}{\rho_{\sigma_{A}} \cdot \left( {\rho_{\sigma_{B}} \otimes \gamma} \right)}} = {\frac{1}{2}{\rho_{\sigma_{A}} \cdot {\phi_{\sigma_{B}}.}}}}} \end{matrix} & (19) \end{matrix}$

In physical terms this means that the reciprocal sum energy, which can be thought of as the energy of the point charges interacting with the potential field due to (minus) the screening charge distribution, is equivalent to the interaction of Gaussian distributed charges with the electrostatic potential due to a screening charge distribution built from more narrowly distributed charges. While the constraint σ_(A) ²+σ_(B) ²=σ² means that σ_(A) and σ_(B) cannot both be chosen independently, and the energy is independent of the ratio σ_(A)/σ_(B) which may chosen freely. Note that the reciprocal sum contribution to the force on particle i may be also written in terms of φ_(σ) _(B) as

$\begin{matrix} {F_{i}^{\sigma} = {{- \frac{\partial E_{\sigma}}{\partial r_{i}}} = {{- \frac{\partial\rho_{\sigma_{A}}}{\partial r_{i}}} \cdot \varphi_{\sigma_{B}}}}} & (20) \end{matrix}$

where again we have used Equation (16).

The convenience of the compact notation will become apparent when we additionally consider mesh operations, since these additional operations may also be written as convolutions. The ability to rewrite the energy in different forms, in a similar way to described above, allows computational weight to be shifted between different convolutions and gives a tunable parameter (similar to σ_(A)/σ_(B)) which may be varied to minimize the total computational burden. Without using a mesh-based method, the basic Ewald method is O(N²) for fixed σ. For example, substituting from the basic definitions into Equation (18) or Equation (19) gives

$\begin{matrix} {E_{\sigma} = {\frac{2\pi}{V}{\overset{\prime}{\sum\limits_{k}}{\frac{{\mathbb{e}}^{{- \sigma^{2}}{k^{2}/2}}}{k^{2}}{{{\overset{\sim}{\rho}}_{k}}^{2}.}}}}} & (21) \end{matrix}$

(As is common practice, we omit the k=0 term as indicated by the prime on the sum, and do so consistently throughout this paper. A more rigorous analysis shows how the k=0 term depends on the boundary conditions at infinity, its omission corresponding to “tin-foil boundary conditions”.) For a given σ and accuracy requirement the number of values of k which must be summed over is proportional N. Obtaining the Fourier representation of the charge density, i.e {tilde over (ρ)}_(k), over this range using Equation (14) directly is thus O(N²). As mentioned in the introduction, increasing a can transfer computational burden to the O(N) direct sum, leading to an overall O(N^(3/2)) method, but for the number of particles in typical bimolecular simulations a significant increase in computation speed can be made by using mesh methods.

Ewald Mesh Methods

There are two classes of mesh-based methods. Real space (spatial domain) mesh methods take advantage of fast finite-difference Poisson solvers to solve the Poisson equation in real space. The other class, FFT based methods, solve the Poisson equation in reciprocal space using FFTs to transform a charge density to reciprocal space and inverse FFTs to transform the electrostatic potential back to real space. Both approaches are explained in more detail below, but first we briefly describe two operations common to both: going from an off-mesh to on-mesh charge distribution (charge spreading), and conversely going from a potential defined on-mesh to the forces on the off-mesh particles. Each of these operations may be written as a convolution. An optimal choice of convolution kernel for what are sometimes called the discretization and interpolation steps is known to be crucial for the efficiency and accuracy of an Ewald mesh method.

Referring to FIGS. 7A-7B, a representative discrete charge distribution ρ(r) is illustrated with three point charges (80). For charge-spreading, an on-mesh charge distribution ρ^(S)(r), which is defined at the discrete grid locations, is created by convolving the point charge distribution with a charge spreading function S (82) and sampling the result of the convolution (84):

$\begin{matrix} \begin{matrix} {{\rho^{S}\left( r_{m} \right)} = {S \otimes \rho}} \\ {= {\int_{- \infty}^{\infty}{{S\left( {r_{m} - r} \right)}{\rho(r)}{\mathbb{d}^{3}r}}}} \\ {= {\sum\limits_{i = 1}^{N}{\sum\limits_{n}{q_{i}{S\left( {r_{m} - r_{i} - {nL}} \right)}}}}} \\ {\approx {\sum\limits_{i = 1}^{N}{q_{i}{{S\left( r_{im}^{\min} \right)}.}}}} \end{matrix} & (22) \end{matrix}$

Here (and below) we use m as an index for mesh points that lie within the primary box. There are N_(m)=(L/h)³ mesh points per box in a simple cubic array with a distance h between each point and its nearest neighbors. The label n runs over all boxes and r_(im) ^(min) is the vector from mesh point m (at r_(m) in the primary box) to the nearest image of particle i. The final approximate equality of Equation (22) follows because the charge spreading function is chosen to fall off rapidly to zero with distance, so each mesh point can only receive a contribution from at most one image of any particular particle (strictly speaking, this will be an approximation in cases where S(r) merely decays rapidly and does not identically vanish beyond some distance). The number of mesh points N_(S) over which S(r) is non-zero (or cannot reasonably be approximated by zero) is the support of S(r) and partially determines the computational expense of the charge spreading step: for each charge i, S(r_(im) ^(min)) must be evaluated at N_(S) mesh points. Since charge-spreading (together with the analogous force calculation described below) turns out to include a majority of the computation it would be desirable that S(r) has a small support. Unfortunately, using very small supports tends to lead to larger errors in the overall calculation due to the finite mesh size, so an appropriate balance must be found. Note that the object of charge spreading is not to try and reproduce something as close to the original point charge distribution as possible, nor even to try and reproduce ρ_(σ). Since the final result (i.e. energies and forces) is paramount, the object of charge spreading is merely to transfer the charges to the mesh in a well defined way, so that further manipulations can rapidly lead to an accurate final result.

The general approach to computing the energy E or the force on each particle from ρ^(S)(r) is to first compute φ*(r)=ρ^(S)(r){circle around (×)}γ(r){circle around (×)}U(r) at grid locations (86). From φ*(r) grid samples of the potential function can be computed as φ_(σ)(r)=φ*(r){circle around (×)}T(r)=ρ^(S)(r){circle around (×)}γ(r){circle around (×)}U(r){circle around (×)}T(r) (illustrated as 90) assuming that G_(σ)(r)=S(r){circle around (×)}U(r){circle around (×)}T(r). The value of φ_(σ)(r) can be computed at the nonzero locations of ρ(r) (94) in order to compute

$E = {\frac{1}{2}{\rho \cdot \phi_{\sigma}}}$ (92). An alternative is to compute a spread charge distribution ρ^(T)=T{circle around (×)}ρ (96) and then to compute

$E = {\frac{1}{2}{\rho^{T} \cdot \phi^{*}}}$ (98). This computation of the forces is discussed in more detail below. Note that S(r) and T(r) can be chosen to be equal but are not necessarily so, and U(r) can be omitted entirely. Also, the grid-based computation of φ*(r)=ρ^(S)(r){circle around (×)}γ(r){circle around (×)}U(r) can be computed directly in the spatial domain, or alternatively, can be computed in a fast Fourier transform (FFT) domain. Similarly, the energy E can be computed in the FFT domain.

The force computation step is almost identical to charge spreading, although perhaps less intuitively obvious. The force is a result of a convolution of a potential φ* and a second (vector) function, which we write as

${T^{\prime}(r)} = \frac{\mathbb{d}T}{\mathbb{d}r}$ where the scalar function T is even and is often chosen to be the same as the charge spreading function S. To see why this is so, it is first important to realize that the potential φ* is not typically a mesh-based representation of φ_(σ). Instead, it is arranged (as explained below) that φ* is the potential for which some pre-chosen interpolation function T satisfies φ_(σ)=T{circle around (×)}φ*. This is quite analogous to the observation that the charge distribution arising from the charge spreading step does not have to be a mesh-based approximation of either ρ_(σ) or ρ as long as the final forces and energies are calculated correctly. From Equation (16) and Equation (18) we find

$\begin{matrix} {E = {{\frac{1}{2}{\rho \cdot \left( {\phi^{*} \otimes T} \right)}} = {{\frac{1}{2}{\left( {\rho \otimes T} \right) \cdot \phi^{*}}} = {\frac{1}{2}{\rho^{T} \cdot \phi^{*}}}}}} & (23) \end{matrix}$ where ρ^(T)=ρ{circle around (×)}T is defined analogously to ρ^(S). If the energy is calculated in real space (as is necessarily the case for real space methods) then Equation (23) simply says that one could either use the convolution with T to take the off-mesh charges to the on-mesh electrostatic potential, or alternatively use it to take the charges to the potential. Differentiating Equation (23) gives the force on the i^(th) particle as

${F_{i}^{\sigma} = {{- \frac{\partial\rho^{T}}{\partial r_{i}}} \cdot \varphi^{*}}},$ and further manipulation shows this may be rewritten F _(i) ^(σ) =q _(i) F ^(σ)(r _(i)) where F ^(σ) =T′{circle around (×)}φ*,  (24)

as stated above. In practice, and analogously to Equation (22), the force will be evaluated as a mesh convolution

$\begin{matrix} {{F_{i}^{\sigma} = {q_{i}h^{3}{\sum\limits_{m{({r_{i},T})}}{{\phi^{*}\left( r_{m} \right)}{T^{\prime}\left( r_{im}^{\min} \right)}}}}},} & (25) \end{matrix}$ where m(r_(i),T) runs over the points of support for T(r_(im) ^(min)).

Referring to FIG. 7C computation of the force on the i^(th) particle from the grid values of φ* (88) involves applying the spreading function T(r) (104) to the charge distribution to each charged particle, such as the particle at r_(i) by first computing its vector of spatial derivatives

${T^{\prime}(r)} = {\frac{\mathbb{d}}{\mathbb{d}r}{T(r)}}$ (108) and then evaluating these spatial derivatives, centered at the particle location r_(i), at grid locations r_(m) (110). The force component F_(i) ^(σ) on the i^(th) particle is then computed using the direct sum over grid locations of φ* (88) and the samples of the spatial derivatives of the spreading function T′(r_(im) ^(min)) (108).

Referring to FIG. 2 a real space method 50 is shown. Method 50 includes generating 152 a mesh-based charge density using ρ^(S)=ρ{circle around (×)}S. Method 150 also includes iteratively solving 54 the Poisson Equation ∇²φ*=−4πρ^(S) on the real space mesh using a discrete representation of ∇². For example, multigrid and SOR methods can be used. This yields φ*=γ{circle around (×)}ρ^(S). Subsequently, method 150 includes calculating 156 the forces from F_(i) ^(σ)=q_(i)T′{circle around (×)}φ*. If the electrostatic potential at the particle positions is required it may be calculated from φ_(σ)=φ*{circle around (×)}T, and the energy follows from

$E = {\frac{1}{2}{\rho \cdot {\phi_{\sigma}.}}}$

Since it is desired to recover φ_(σ)=ρ{circle around (×)}G_(σ){circle around (×)}γ, this implies S and T be chosen so that S{circle around (×)}T=G_(σ). One choice is S=T=G_(σ/√{square root over (2)}), which has the advantage (in the case where φ_(σ) is not required) that it removes the need to perform a convolution for the energy, which is obtained from

$E = {\frac{1}{2}{\rho^{S} \cdot {\phi^{*}.}}}$

Referring to FIG. 9, a FFT based Ewald method 170 is shown. Method 170 includes generating 172 a mesh-based charge density using ρ^(S)=ρ{circle around (×)}S and performing 174 the FFT ρ^(S)→{tilde over (ρ)}^(S). Method 170 includes solving 176, in k-space, a modified Poisson equation φ*=γ_(mod){circle around (×)}ρ^(S), which is approximately {tilde over (φ)}_(k)*={tilde over (γ)}_(mod)(k){tilde over (ρ)}_(k) ^(S). Method 170 also includes calculating the energy

$E_{\sigma} = {{\frac{1}{2}{\rho \cdot \left( {T \otimes \phi^{*}} \right)}} = {\frac{V}{2}{\sum\limits_{k}{\frac{\overset{\sim}{T}(k)}{\overset{\sim}{S}(k)}{{\overset{\sim}{\gamma}}_{mod}(k)}{{\overset{\sim}{\rho}}_{k}^{S}}^{2}}}}}$ (S=T in some examples). Subsequent to the energy calculation, method 170 included performing 178 an inverse FFT {tilde over (φ)}*→φ* and calculating 180 the forces from F_(i) ^(σ)=q_(i)T′{circle around (×)}φ*. If the electrostatic potential at the particle positions is required it may be calculated from φ_(σ)=φ*{circle around (×)}T.

Writing out the contributions to the electrostatic potential explicitly, results in the equation φ_(σ) =ρ{circle around (×)}S{circle around (×)}γ _(mod) {circle around (×)}T,  (26)

and since φ_(σ)=ρ{circle around (×)}G_(σ){circle around (×)}γ, this implies S and T and γ_(mod) be chosen so that S{circle around (×)}γ _(mod) {circle around (×)}T=G _(σ){circle around (×)}γ.  (27)

One choice is S=T=G_(σ/√{square root over (2)}) with γ_(mod)=γ is possible. However, enforcing γ_(mod)=γ requires S{circle around (×)}T=G_(σ), and thus the full width of G_(σ) must come from the convolutions with S and T just as in the real space method. Instead, by performing an additional convolution in reciprocal space (which is computationally trivial) the amount of spreading in real space can be much diminished, significantly speeding up the calculation by much reducing the support required for S and T. The additional reciprocal space convolution U is a modification of the Poisson Green function, i.e. γ_(mod)=U{circle around (×)}γ. A possible choice is S=T and U chosen such that G_(σ)=S{circle around (×)}U{circle around (×)}T. Other choices do not necessarily has S equal T.

An alternative to use of Gaussian distributions is to use as low an order of B-spline function as possible to minimize the support, however higher order B-splines are smoother functions and lead to smaller errors due to the discrete operations, so there are competing effects and typically the optimum B-spline used to represent a charge extends over more than the nearest mesh points, but its support is much less than that of G_(σ/√{square root over (2)}).

Equation (26) provides a framework in which most of the various mesh Ewald methods may be summarized in a consistent form. These methods differ principally in their choices of S, T and γ_(mod) functions and the mathematical space in which the Poisson equation is solved. Equation (27) provides a simple but important criterion by which choices of S, T and γ_(mod) can be evaluated.

Gaussian-Split Ewald Method

The Gaussian-split Ewald (GSE) method can be used both with a real space and reciprocal space methods of solving the Poisson equation. GSE involves two stages of charge spreading. First, charges are spread to the mesh by convolving with a function with small support. The small support ensures that the operation is rapid. Then a second convolution (with U) is performed to further spread the charges, which is very fast since it can be performed on-mesh in the real space version r-GSE (in the k-space version, k-GSE this second convolution is done in k-space). The final interpolation step to calculate the forces is also performed rapidly by convolving with a function (T) with small support. In this embodiment, spreading functions are chosen to satisfy Equation (27).

From Equation (27) we know that, with choice of standard Green function (i.e. γ_(mod)=γ) S and T should satisfy S{circle around (×)}T=G_(σ). A two stage charge spreading method splits S into two parts, so by definition S=S₁{circle around (×)}S₂, and Equation (27) implies S₁{circle around (×)}S₂{circle around (×)}T=G_(σ). We choose S₁=T=G_(σ) ₁ and S₂=G_(σ) ₂ with the Gaussian variances satisfying 2σ₁ ²+σ₂ ²=σ².  (28)

Substituting the GSE choice of S, γ_(mod) and T into Eq. (26), we find φ_(σ) =ρ{circle around (×)}G _(σ) ₁ {circle around (×)}G _(σ) ₂ {circle around (×)}γ{circle around (×)}G _(σ) ₁ ,  (29)

which effectively defines the GSE method. An advantage of this approach is that by tuning the ratio of σ₁/σ₂ GSE allows computational load to be shifted away from the bottleneck charge-spreading and interpolation steps to the highly efficient second charge spreading step (which takes advantage of the fact that an on-grid convolution with a Gaussian is nearly trivial computationally) and it does so without violating Equation (27).

Referring to FIG. 10, corresponding to each convolution in Eq. (18), a process 190 for r-GSE is shown. Process 190 includes a First charge spreading (step 192), for example, ρ_(σ) ₁ =ρ{circle around (×)}G_(σ) ₁ . In the first charge spreading, each particle charge is spread on the grid by convolving with G_(σ) ₁ . From Equation (22), the computation to be performed is

$\begin{matrix} {{\rho_{\sigma_{1}}\left( r_{m} \right)} = {\frac{1}{\left( {2{\pi\sigma}_{1}^{2}} \right)^{3/2}}{\sum\limits_{i = 1}^{N}{q_{i}{{\exp\left( {{{- {r_{im}^{\min}}^{2}}/2}\sigma_{1}^{2}} \right)}.}}}}} & (30) \end{matrix}$

Process 190 also includes a second charge spreading (step 194), for example,

$\rho^{s} = {\rho_{\sqrt{\sigma_{1}^{2} + \sigma_{2}^{2}}} = {\rho_{\sigma_{1}} \otimes {G_{\sigma_{2}}.}}}$ A second (and more efficient) convolution with G_(σ) ₂ is performed to complete the charge spreading. This convolution is carried out taking advantage of separability of Gaussian functions, which allows the three dimensional Gaussian convolution to be replaced by three trivial one dimensional convolutions (one along each dimension). Using the separability, one convolves each row with a Gaussian (i.e., along the x-axis), then convolves each column of the result with a Gaussian (i.e., along the y-axis), and finally convolves with a Gaussian along the z-axis.

Subsequently, process 190 includes solving the Poisson equation on mesh (step 196), for example using φ*=ρ^(S){circle around (×)}γ. In r-GSE, using the charge density ρ^(S) obtained in step (2), the Poisson equation is directly solved in real space using either with SOR or multigrid techniques. For example, a Hermitian discrete representation on the finest grid can be used to achieve higher accuracy. Note that, the mesh based potential could equivalently be written

$\phi^{*} \equiv {\phi_{\sqrt{\sigma_{1}^{2} + \sigma_{2}^{2}}}.}$

Subsequently, process 190 includes interpolating the potential (step 198), for example using φ_(σ)=ρ_(σ) ₁ {circle around (×)}φ* (and F_(i) ^(σ)=q_(i)G_(σ) ₁ ′{circle around (×)}φ*). With the on-mesh potential φ* computed, the potential at point r_(i) may be obtained (if required) by interpolation using G_(σ) ₁ as the interpolation kernel

$\begin{matrix} {{\phi_{\sigma}(r)} = {\frac{h^{3}}{\left( {2{\pi\sigma}_{1}^{2}} \right)^{3/2}}{\sum\limits_{m}{{\exp\left( {{{- {r_{im}^{\min}}^{2}}/2}\sigma_{1}^{2}} \right)}{{\phi^{*}\left( r_{m} \right)}.}}}}} & (31) \end{matrix}$ and the force on particle i is

$\begin{matrix} {F_{i}^{\sigma} = {\frac{q_{i}h^{3}}{\left( {2\pi} \right)^{3/2}\sigma_{1}^{5}}{\sum\limits_{m}\left( {r_{im}^{\min}{\exp\left( {{{- {r_{im}^{\min}}^{2}}/2}\sigma_{1}^{2}} \right)}{{\phi^{*}\left( r_{m} \right)}.}} \right.}}} & (32) \end{matrix}$

Remember that r_(im) ^(min) is the vector from mesh point m (at r_(m) in the primary box) to the nearest image of particle i.

Note that the energy

$E = {{\frac{1}{2}{\rho_{\sigma_{1}} \cdot \phi^{*}}} = {\frac{h^{3}}{2}{\sum\limits_{m}{{\rho_{\sigma_{1}}\left( r_{m} \right)}{\phi^{*}\left( r_{m} \right)}}}}}$

can be calculated on mesh before the interpolation step, provided that the values of ρ_(σ) ₁ on the mesh from step (1) are kept in memory.

While the example above was described in real space, similar splitting of the Gaussian may also be used with an FFT approach. In k-GSE the second charge spreading step is done as a multiplication in reciprocal space (which we write as a modification of the Green function), i.e. φ_(σ)=ρ{circle around (×)}G_(σ1){circle around (×)}(G_(σ2){circle around (×)}γ){circle around (×)}G_(σ1)=ρ{circle around (×)}G_(σ1){circle around (×)}(γ_(mod)){circle around (×)}G_(σ1). Steps (1) and (4) of k-GSE are algorithmically identical to r-GSE, although to be consistent with previous notation we term the charge density produced after step (1) in k-GSE ρ^(S) [rather than that produced after step (2)]. Instead of steps (2) and (3), the Poisson equation is solved in reciprocal space, i.e. steps (ii), (iii) and (v) of the general FFT Ewald method [see previous subsection] are substituted for steps (2) and (3).

A feature of the GSE approach, common to both the real and k-space implementations, relates to the unified GSE framework as a series of convolutions across each step in the approach: charge spreading, solving the Poisson equation, and calculating forces. For a desired accuracy, the balance between these steps can be varied in a continuous manner by setting the parameter κ, which (when σ for the screening Gaussian charge distribution is given) determines the standard deviation of the Gaussians used in the charge spreading and force calculations: σ₁=σ√{square root over (κ)} 0≦κ≦½

For a given value of σ the value of κ also sets the standard deviation of the second Gaussian, according to: σ₂=σ√{square root over (1−2κ)}

There are also a number of specific improvements that the GSE method affords to a real space implementation. These improvements effectively serve to accelerate real space computation for a given accuracy requirement by significantly reducing the size of the support number of mesh-based grid points needed in charge spreading and force calculation. Additional benefits for the r-GSE arise from the treatment of the second convolution in real-space. Rather than employ a diffusion scheme this second spreading is implemented as an exact on-mesh Gaussian convolution. Not only is this approach more accurate than the low order discrete representation of the Laplacian operator in the diffusion equation, the convolution can be efficiently computed by exploiting the dimensional separability of Gaussian functions.

A Recipe of Gaussian-Split Ewald Method (GSE) for the Distant Subsystem

The Gaussian-Split Ewald method can be used to calculate the effect of distant electrostatic forces on particles. The method includes charge spreading from particles to grid points, fast Fourier transformation of charge density, operations in k-space on charge density, inverse Fast Fourier transformation, and the calculation of distant electrostatic forces on particles as described above.

GSE involves three independent parameters: the Gaussian standard deviation σ shared by a distant subsystem and a middle subsystem, another Gaussian standard deviation σ_(r) used in charge spreading and force calculation, and the grid spacing Δ. Respectively, σ and σ_(r) are positively correlated to the distance cutoff in the middle subsystem, and the cutoff of charge spreading and force calculation in the distant subsystem. For reasonable accuracy, distance cutoffs are empirically chosen, R_(c) ^(mid)=3.2√{square root over (2)}σ and R_(c) ^(dis)=3√{square root over (2)}σ_(r) for the middle and the distant system. Greater cutoff-sigma ratio may be chosen to achieve higher accuracy. Another Gaussian function is involved in the k-space operations, whose standard deviation in the real-space is σ_(k)=√{square root over (σ²−2σ_(r) ²)}. For example, a GSE parameter set can include: Grid spacing Δ=2A, R_(c) ^(mid)=13A, σ=2.873A R_(c) ^(dis)=7.04A, σ_(r)=1.659A σ_(k)=1.657A

In addition, when a simulation system is given, its side-lengths Lx, Ly and Lz in angstroms, and the number of grid points at each side Nx=Lx/Δ, Ny=Ly/Δ, and Nz=Lz/Δ are important in the algorithm. It is assumed that we only deal with rectangular/cubic systems.

During the charge spreading, particles of given charges and coordinates are present in the system box, which is covered by a mesh of cubic cells (with grid spacing Δ). The purpose of charge spreading is to assign a charge density value to each grid point in the mesh. Each grid point receives contributions of charges from all the particles within the distance cutoff R_(c) ^(dis). The same cutoff is also applied in the force calculation step later. The charge density contribution from a particle to a grid point is

${\frac{1}{2\sqrt{2}\sigma_{r}^{3}\pi^{3/2}}q\;{\exp\left( {{{- r^{2}}/2}\sigma_{r}^{2}} \right)}},$ where q indicates the particle's charge and r≦R_(c) ^(dis) the distance between the particle and the grid point. Periodical boundary conditions should be maintained in charge spreading. Specifically, a grid point should receive charge contributions from particles in the simulation system as well as its mirror systems, as long as they are within the distance cutoff. The accumulation of charges at grid points result in a charge density ρ(i,j,k) that is defined on the mesh, with i,j,k being the x,y,z indices of grid points.

During the FFT of charge density on mesh, a 3D FFT is performed, which converts charge density ρ into its k-space representation {tilde over (ρ)}=FFT(ρ). It should be noted that {tilde over (ρ)} are complex numbers defined at grid points in a mesh in k-space. The k-space mesh covers kx from

${\left( {{{- {Nx}}/2} + 1} \right)\frac{2\pi}{L\; x}\mspace{14mu}{to}\mspace{14mu}\left( {{Nx}/2} \right)\frac{2\pi}{Lx}},$ ky from

${\left( {{{- {Ny}}/2} + 1} \right)\frac{2\pi}{Ly}\mspace{14mu}{to}\mspace{14mu}\left( {{Ny}/2} \right)\frac{2\pi}{Ly}},$ and kz from

${\left( {{{- {Nz}}/2} + 1} \right)\frac{2\pi}{Lz}\mspace{14mu}{to}\mspace{14mu}\left( {{Nz}/2} \right)\frac{2\pi}{Lz}},$ with spacing

$\frac{2\pi}{Lx},{\frac{2\pi}{Ly}\mspace{14mu}{and}\mspace{14mu}\frac{2\pi}{Lz}}$ respectively, where kx, ky, kz are the x, y, z components of the wavenumber vector k. In other words, {tilde over (ρ)} is indexed by three integers, namely i=(−Nx/2+1) . . . (Nx/2), j=(−Ny2+1) . . . (Ny2), and k=(−Nz/2+1) . . . (Nz/2).

Because ρ is always real, by properties of Fourier transformations, {tilde over (ρ)} holds certain symmetry that may exploited in computations. Henceforth, for convenience the real and imaginary components of {tilde over (ρ)} will be denoted by {tilde over (ρ)}_(R) and {tilde over (ρ)}_(I) respectively in this document.

As mentioned previously, for performing operations in k-space, each grid point in the k-space may by defined by three indices (i,j,k) or equivalently by a wavenumber vector k=(kx,ky,kz), with

${{kx} = {i\;\frac{2\pi}{Lx}}},{{ky} = {{j\;\frac{2\pi}{Ly}\mspace{14mu}{and}\mspace{14mu}{kz}} = {i\;{\frac{2\pi}{Lz}.}}}}$ At each k-space grid point reside {tilde over (ρ)}_(R), {tilde over (ρ)}_(I) and a pre-calculated influence function (a real function)

${{I(k)} = {\frac{4\pi}{k^{2}}{\exp\left( {{- 2}k^{2}\sigma_{k}^{2}} \right)}}},$ where k²=kx²+ky²+kz². Straightforwardly update {tilde over (ρ)}_(R)(i,j,k)←{tilde over (ρ)}_(R)(i,j,k)I(i,j,k) and {tilde over (ρ)}_(I)(i,j,k)←{tilde over (ρ)}_(I)(i,j,k)I(i,j,k) is carried out at each grid point. Explicitly the influence function at point (i,j,k) is:

${I\left( {i,j,k} \right)} = {\frac{4\pi}{\left( {i\;\frac{2\pi}{Lx}} \right)^{2} + \left( {j\frac{2\pi}{Ly}} \right)^{2} + \left( {k\;\frac{2\pi}{Lz}} \right)^{2}}\exp\left\{ {{- {2\left\lbrack {\left( {i\;\frac{2\pi}{Lx}} \right)^{2} + \left( {j\frac{2\pi}{Ly}} \right)^{2} + \left( {k\;\frac{2\pi}{Lz}} \right)^{2}} \right\rbrack}}\sigma_{k}^{2}} \right\}}$

After the influence function being applied to {tilde over (ρ)}, a 3-D inverse FFT is performed and electrostatic potential is obtained: φ=iFFT[I(k){tilde over (ρ)}_(R)(k), I(k){tilde over (ρ)}_(I)(k)]

In the FFT calculation, an electrostatic potential φ(i,j,k) is determined at each grid point indexed by (i,j,k) in real-space this electrostatic potential is used during the subsequent force calculation. The force calculation is similar to charge spreading in that each particle receives a force contribution from the grid points within the distance cutoff R_(c) ^(dis). Specifically, the x,y,z components of the force contributed from grid point (i,j,k)=(g) to a particle (i) is:

${f_{i,\alpha} = {\frac{\Delta^{3}}{2\sqrt{2}\sigma_{r}^{5}\pi^{3/2}}q\;{\exp\left( {{{- r_{ig}^{2}}/2}\sigma_{r}^{2}} \right)}{\phi\left( {i,j,k} \right)}d\;\alpha_{ig}}},$ where α=(x,y,z), q represents the particle's charge, r_(ig) the distance between the particle and the grid point, φ(i,j,k) the potential value at the grid point, and dα_(ig) has three components which correspond to the x, y, and z separation between the grid point and the particle (e.g. dx=the particle's x coordinate−x coordinate of grid points (i,j,k) ). For each particle force contributions are accumulated from all the grid points within the cutoff, resulting in the final distant forces asserted on each particle of the system. Periodical boundary conditions should be considered in the same way as in the charge-spreading step.

Energy calculation in GSE is inexpensive, and amounts to summing over each grid pint of the mesh while accumulating the product of grid charge and potential:

$E_{dis} = {\frac{\Delta^{3}}{2}{\sum\limits_{mesh}{{\rho\left( {i,j,k} \right)}{{\phi\left( {i,j,k} \right)}.}}}}$

A system can be of varying size and include a variable number of particles. For example, the average side-lengths of simulation systems range from 32A to 256A, and the system may contain 3,000 to 1,700,000 atoms.

Direct Summing of Pairwise Interactions

In both straightforward enumeration of pairwise interactions between bodies, as well as in computation of the direct sum term in the Ewald methods, efficient arrangement of the computations is desirable. One approach uses multiple computational nodes, each responsible for some of the pairwise calculations. These computational nodes can be associated with physical regions, for example, with a box 11 (FIG. 1) being subdivided into smaller cubes, and each cube is associated with particles in that cube and with one of the computational nodes, which maintain data related to those particles.

Computational nodes can be arranged in hardware architecture with communication paths coupling the nodes. For example, nodes can be implemented on sets of ASICS and arranged on processor boards to form such a communication path. The import and export is optimized according to the available communication paths in the architecture. For example, the import and export regions can be selected to optimize or match the communication paths of the architecture.

Referring to FIG. 11, a system computes interactions for pairs of particles in a computation region 200 through pairwise summation. At the system level, a type of spatial decomposition coordinates the processing of interactions between the particles. The spatial decomposition divides the simulation space 200 into a number of rectangular parallelepipeds (also referred to as boxes) with dimensions G_(x) (206), G_(y) (204), and G_(z) (202) (also shown in FIG. 1). A computation system includes an array of processing elements, each of which takes as input a pair of particles and produces either the force on one particle due to the other or the potential energy contribution from the pair.

Referring to FIG. 12, as described above, the simulation space 200 is divided into multiple packed rectangular parallelepipeds 212. Under this assumption, the interaction neighborhood 210 of a given home box (H) is defined as a region of space surrounding the home box that consists of the locus of all points outside of the home box that lie within a distance R (216) of a point in the home box.

The surface boundary of a single home box can be divided into 26 subregions including six face regions, twelve edge regions, and eight corner regions. The six face regions, denoted γ_(−x), γ_(+x), γ_(−y), γ_(+y), γ_(−z) and γ_(+z), are associated with one of the six faces of the home box. Face region γ_(−x), for example, is an hy×hz×R box whose base is the low-x-coordinate face of the home box, and which extends outward from the home box in the −x direction for a distance R. Twelve edge regions, denoted γ_(−x−y), γ_(−x+y), γ_(+x−y), γ_(+x+y), γ_(−x−z), γ_(−x+z), γ_(+x−z), γ_(+x+z), γ_(−y−z), γ_(−y+z), γ_(+y−z) and γ_(y+y+z), are associated with one of the twelve edges of the home box. Edge region γ_(−x−y), for example, is an “outward-pointing” quarter-cylinder of radius R and length hz whose axis coincides with the low-x-, low-y-coordinate edge of the home boxH. The eight corner regions, are denoted γ_(−x−y−z), γ_(−x−y+z), γ_(−x+y−z), γ_(−x+y+z), γ_(+x−y−z), γ_(+x−y+z), γ_(+x+y−z) and γ_(+x+y+z), each associated with one of the eight corners of the home box. Corner region γ_(−x−y−z), for example, is an “outward-pointing” octant of a sphere of radius R whose center coincides with the low-x-, low-y-, low-z-coordinate corner of the home box.

As described above, the simulation space box 200, referred to as the global cell, is partitioned into a number of smaller boxes, each associated with a single station in a single processing node and referred to as the home box associated with that station. A particle p whose position coordinates fall within a given home box will be described as residing within the home box, and the home box will be referred to as the home box of p.

Referring to FIG. 13, the dimensions h_(x), h_(y) and h_(z) of each home box are chosen in such a way that G_(d)=g_(d) h_(d) for dε{x, y, z}, where g_(x), g_(y) and g_(z) are constrained to be integral powers of two whose product is equal to the number of stations in the segment. Subject to these constraints, the g_(d), and the dimensions of the home box, will be chosen in such a way as to minimize inter-station communication traffic. To avoid irregularities in that portion of the solvent lying along its boundaries due to the existence of the boundary, the global cell serves as the unit cell of an infinite, spatially periodic system with period G=(G_(x), G_(y), G_(z)). Thus, a molecule near the +x boundary of the global cell, for example, will interact locally with another molecule near the −x boundary having similar y and z coordinates.

The decomposition assigns each processing node a region of space, allowing for nearest-neighbor communications and gives each node responsibility for a subset of particle pairs chosen to limit communication requirements. One example of a spatial decomposition assigns particle pairs to nodes using a “half-shell” method. In the half-shell method roughly, each processing node computes interactions between its own particles and any external particle within the cutoff radius that has a greater x-coordinate. Looking at this in a different manner, given any two particles separated by less than the cutoff, the node that will calculate their interaction is the node that “owns” the particle with the smaller x-coordinate. Recall that for each timestep, every node must import data on the positions and properties of particles with which it must interact, and later export data on the forces or energies due to those interactions. As a result of the half-shell method, each processing node imports data from (and exports data to) a region of the simulation space corresponding to half of a “shell” with thickness equal to the cutoff radius surrounding that node's assigned box.

Referring to FIG. 14, at the beginning of each simulation time step, each processing node contain the particle data for those particles currently residing within its home box. During a given time step, however, some (and possibly all) of these particles will need to be interacted with certain particles residing in nearby (in a sense that will depend on the distant interaction scheme) home boxes as well. In order to interact the particles, the processing node imports (step 222) data for particles within a particular region associated with the home box. Using the imported data, the node calculates (step 224) interactions between particles in the combination of the home box and the imported region. The system subsequently exports (step 226) the interaction data to the appropriate home boxes. This process 220 can be performed in parallel on processing nodes for multiple home boxes and regions or alternatively serially on fewer processors. In addition, the process 220 can be iterated to produce a series of time based positions and forces for particles in the system. If multiple time steps are to be calculated, the system determines (step 228) if time steps remain and if so, imports the updated data (step 232) (e.g., data from the previous time step) for particles in the associated calculation region for the home box. The process subsequently calculates (step 224) the interactions and exports (step 226) the data to the appropriate home box.

As shown in FIGS. 15 and 16, a decomposition of the simulation space based on “orthogonal” data import and interaction regions (referred to as the orthogonal method) is shown. In this decomposition, given any two particles separated by less than the cutoff, the node that calculates the interaction of the pair of particles is the node that owns the box in the x−y plane of the particle with the greater x-coordinate and in the z-line of the particle with the smaller x-coordinate. The result of this distribution of computation is that each node must import data from (and export data to) a certain column 252 (called the tower) and a certain slab 254 (called the plate) of the simulation space. This method has advantages over the half-shell method, including less communication when the cutoff radius is large compared to the box size.

Assuming continuous decomposition, the import region 150 of the orthogonal method consists of the union of four face regions (γ+x, γ+y, γ−z and γ+z) and two edge regions (γ+x−y and γ+x+y), but includes no corner regions. The lack of corner regions is a feature that accounts for its advantage over the half-shell method. For convenience, certain portions of the import region are given names. In particular, γ+z is referred to as the upper tower 254, while γ−z is referred to as the lower tower 258. The union of the upper tower 254 and the lower tower 258 is referred to as the outer tower, while the union of the outer tower and the home box 256 is referred to simply as the tower. The union of subregions γ+y 266 and γ+x+y 264 is referred to as the north plate, while the union of γ+x 262 and γ+x−y 260 is referred to as the east plate. The union of the north and east plates is referred to as the outer plate, while the union of the outer plate and the home box is referred to simply as the plate 254. It should be noted that the home box 256 belongs to both the tower 252 and the plate 254. Intuitively, the tower 254 is the box that would be obtained by stretching the home box 256 by a distance R in both the positive z and negative z directions. The plate includes the home box 256 and an adjacent “terrace” of thickness h_(z) extending (roughly speaking) a distance R away from the tower, but continuing only part of the way around it. The import region employed by the orthogonal method (assuming continuous decomposition) is illustrated in FIGS. 15 and 16.

Referring to FIG. 17, using the orthogonal method, the processing node associated with each home box executes a particular subset of the set of interactions required during a given time step. In particular, the set of interactions executed within the station associated with home box is defined such that particles are only interacted if separated by a distance of no more than R and each pair of particles is interacted only one time. Each particle p in the outer plate of the home box is interacted with each particle in its tower 302 (rule 1). Each particle p in the home box is interacted with each particle in the upper tower of the home box 304 (rule 2a). Additionally, each particle p in the home box is interacted with each particle p′ in the home box (or overlap region) for which pid (p′)>pid (p), where pid (p) is the particle identification number of particle p 306 (rule 2b).

These interaction rules reveals that each interaction occurring within the station associated with the home box involves one particle from the tower of the home box and one particle from the plate of the home box. Although one or both of these particles may reside within the home box itself (which by definition belongs to its own tower and plate), it will often be the case that neither particle resides within the processing node in which they interact, since interaction rule 1 allows a particle in the outer plate of a given home box to be interacted with a particle in the outer tower of that home box. This stands in contrast with the half-shell method, in which each pairwise particle interaction occurring within a given station involves at least one particle that resides within that station's home box. The calculation of potential energy follows the same procedure outlined above for the half-shell method, as does the local accumulation of force vectors. In the orthogonal method, however, when neither of the two interacted particles resides within home box H, a force contribution is exported to the home boxes of both of these particles. Along the way to these home boxes, each such force component is combined with other force components bound for the same destination particle. In the typical case of a home box whose side length is smaller than R, the half-shell method will result in the interaction of a relatively small number of particles residing within its home box with a much larger number of particles that must be imported from other home boxes. In the orthogonal method, the number of interactions occurring within each home box is roughly the same as in the half-shell method, but these interactions are obtained by importing a roughly equal number of particles from its outer tower and outer plate. Just as the perimeter of a square is smaller than that of any other rectangle of equal area, balancing the number of pRecs imported from the tower and plate tends to minimize the amount of data that has to be imported (a rough analog of the perimeter of a rectangle) in order to execute a given number of interactions (a rough analog of its area). A similar argument can be made to explain the advantage of the orthogonal method in exporting and combining pairwise force vectors.

Communication Requirements

This section provides a quantitative estimate of the communication requirements for the orthogonal method, assuming continuous decomposition and (for simplicity) a cubical home box with h_(x)=h_(y)=h_(z)=h. Note that in this case, the volumes of a single face region, edge region, and corner region of the home box are given by V_(f)=h²R V _(e) =πhR ²/4 V _(c) =πR ³/6,

The volume of the half-shell method's import region is V_(h)=3 V_(f)+6 V_(e)+4 V_(c), which is O(h²R+hR²+R³),

The import region for the orthogonal method is the summation of the 4 face regions and the two edge regions: Vo=4V _(f)+2Ve,

which is O (h²R+hR²). Taking constant factors into account, we find that the orthogonal method is associated with a smaller import volume (and a smaller number of pRecs that need to be imported) whenever 4(V _(e) +V _(c))>V _(f),

or equivalently, whenever

$h \leq \frac{\left( {{3\pi} + \sqrt{24 + {9\pi^{2}}}} \right)R}{6} \approx {3.34{R.}}$

The analysis above assumes a cubic home box and may underestimate the advantages of the orthogonal method relative to the half-shell method, since the selection of a non-cubic home box may provide additional savings in the amount of data that must be imported by the former. Specifically, if we keep h_(x)=h_(y) but allow h_(z) to vary, the optimum ratio of h_(z) to h_(x) and h_(y) decreases as the number of PNs becomes larger and the volume of each home box consequently becomes smaller. The optimal aspect ratio for the home box chosen for use with the orthogonal method, however, depends on the size and organization of the machine segment.

Although the above analysis has been cast in terms of the import of particle data records into the home region, the same analysis holds for the export of force vectors to those home boxes from which the imported particles were obtained. The analysis is also easily adapted to the case in which distant interactions are handled using one of the box decomposition schemes. In this case, the γ subregions are all boxes and the boundaries of the import regions associated with the two import methods are planar, but the asymptotic results are identical.

Note that the above analysis takes into consideration only the amount of data that must be imported and exported during each simulation time step, and does not take account of the overlap between communication and computation. In most cases, however, it is expected that all tower particle data records (but not all plate particles) will have to be imported before the calculation of pairwise forces can begin. This may represent a disadvantage of the orthogonal method relative to the half-shell method, in which computation can, in principle, begin as soon as the first pRecs are imported into the home box. This disadvantage would be mitigated, however, by a larger ratio of h_(z) to h_(x) and h_(y); in particular, a cubical home box (which may prove advantageous for other reasons) would, for most realistic parameter sets, result in less time being required for tower import than plate import, at the cost of a relatively modest increase in total import volume. It may also be possible to use multithreading techniques to effectively overlay a second simulation on top of the first, overlapping communication in the first simulation with computation in the second and thus “hiding” some or all of the time required for importing tower atoms.

To verify that the orthogonal method causes each pair of particles separated by no more than a distance R to be interacted exactly once, it is useful to distinguish four cases according to whether the home boxes of the two particles have the same coordinates in one or more dimensions. These cases can include if the two home boxes have different x coordinates (case 1), else if the two home boxes have different y coordinates (case 2), else if the two home boxes have different z coordinates (case 3), and else (case 4). Case 2, for example, corresponds to a situation in which the home boxes of the two particles have the same x coordinate, but different y coordinates, with the z coordinate being either the same or different.

In case 1 case, the home boxes of the two particles have different x coordinates. Let t be the point with the smaller x coordinate and p be the other particle, with Ht and Hp defined as their respective home boxes. Now consider the point s=(s_(x), s_(y), s_(z))=(t_(x), ty, pz), which is the intersection of (a) the line parallel to the z axis that contains particle t, and (b) the plane normal to the z axis that contains particle p. Since we've assumed that particles p and t are separated by no more than R, it must certainly be the case that |tz−sz|=|tz−pz|≦R. Since tx=sx, ty=sy, and |tz−sz|≦R, particle t must reside within the tower of the home box Hs containing point s. Turning now to particle p, we note that √{square root over ((s _(x) −p _(x))²+(s _(y) −p _(y))²)}{square root over ((s _(x) −p _(x))²+(s _(y) −p _(y))²)}=√{square root over ((t _(x) −p _(x))²+(t _(y) −p _(y))²)}{square root over ((t _(x) −p _(x))²+(t _(y) −p _(y))²)}≦√{square root over ((t _(x) −p _(x))²+(t _(y) −p _(y))²+(t _(z) −p _(z))²)}{square root over ((t _(x) −p _(x))²+(t _(y) −p _(y))²+(t _(z) −p _(z))²)}{square root over ((t _(x) −p _(x))²+(t _(y) −p _(y))²+(t _(z) −p _(z))²)}≦R

In combination with the assumption that p_(x)≧t_(x) and the fact H_(p) has the same z-coordinate as H_(s) by construction, is easily shown to imply that p must lie within the outer plate of Hs. Thus, interaction rule 1 will cause particles t and p to be interacted within home box H_(s). To verify that these same two particles will not be interacted with each other more than once, note first that because p_(x)≧t_(x), rule 1 will not be triggered (in any home box) when the two particles are interchanged. Moreover, because H_(t) and H_(p) have different x coordinates, neither particle can be in the upper tower of the other, so rule 2(a) will not be triggered. Similarly, the fact that H_(t) and H_(p) have different x coordinates precludes the possibility that the two particles are in the same home box, so rule 2(b) will never be applicable. Thus, if the spatial relationship between the two particles is described by case 1, it must be the case that they will interact exactly once.

In the second case, the home boxes of the two particles share a common x coordinate, but have different y coordinates. In such second case, let t be the point with the smaller y coordinate and p be the other point, with Ht and Hp again defined as their respective home boxes. Because t and p lie within a distance R of each other, particle p must reside within subregion γ+y of home box H_(t), which is part of the outer plate of Ht. Thus, the two particles interact within home box Ht pursuant to rule 1. Because subregion γ−y, unlike subregion γ+y, is not included within the outer plate of a given home box, however, the two particles do not interact within home box Hp. Since Ht and Hp have different y coordinates, neither particle can be in the tower of the other and the two particles cannot share a common home box, thus ruling out a redundant interaction based on either rule 2(a) or 2(b).

In the third case, the home boxes of the two particles have the same x and y coordinates, but different z coordinates. Let p be the particle with the smaller z coordinates and t be the other particle, with H_(p) and H_(t) defined as their respective home boxes. Because the distance between p and t does not exceed R, particle t must lie within the upper tower of H_(p), and the two particles interact within H_(p) as a result of rule 2 (a). Since p falls within the lower tower of H_(t), however, this rule does not result in the two particles being redundantly interacted within H_(t). Because H_(p) and H_(t) have identical x and y coordinates, there can be no home box that contains p within its outer plate and t within its tower, so rule 1 is never applicable, and cannot result in a redundant interaction. Rule 2(b) is also never triggered, since H_(p) and Ht have different z coordinates, and can thus never reside within the same home box. Thus, particles p and t interact exactly once in case 3.

In the fourth case, the two particles lie within the same home box, and are interacted within the home box according to rule 2(b). The particle ID number constraint prevents this rule from causing a redundant interaction within the home box. Because the two particles reside within the same home box, rules 1 and 2(a) are inapplicable, and are thus incapable of causing a redundant interaction. Thus, in this case as well, the two particles are interacted exactly once, completing the proof number of embodiments of the invention have been described. Nevertheless, it will be understood that various modifications may be made without departing from the spirit and scope of the invention.

Alternative versions of the system can be implemented in software, in firmware, in digital electronic circuitry, in computer hardware, in other modes of implementation, or in combinations of such modes. The system can include a computer program product tangibly embodied in a machine-readable storage device for execution by a programmable processor. Method steps can be performed by a programmable processor executing a program of instructions to perform functions by operating on input data and generating output. The system can be implemented in one or more computer programs that are executable on a programmable system including at least one programmable processor coupled to receive data and instructions from, and to transmit data and instructions to, a data storage system, at least one input device, and at least one output device. Each computer program can be implemented in a high-level procedural or object-oriented programming language, or in assembly or machine language if desired. Such language can be either a compiled or interpreted language. Suitable processors include, by way of example, either (or both) general and special purpose microprocessors. Generally, a processor will receive instructions and data from read-only memory and/or random access memory. Generally, a computer will include one or more mass storage devices for storing data files. Such devices include magnetic disks such as internal hard disks and removable disks, magneto-optical disks, or optical disks. Storage devices suitable for tangibly embodying computer program instructions and data include all forms of non-volatile memory, including by way of example semiconductor memory devices such as EPROM, EEPROM, and flash memory devices; magnetic disks such as internal hard disks and removable disks; magneto-optical disks; and CD-ROM disks. Any of the foregoing can be incorporated in or supplemented by ASICs (application-specific integrated circuits). 

1. A method for computing forces on charged particles using a computer system comprising a plurality of physical computing nodes, the method comprising: processing on the plurality of nodes data for a set of charged particles, each node storing data for a corresponding sub-set of the set of particles within a region associated with the node, the processing including processing in the computer system data characterizing a charge distribution associated with a set of charged particles according to a spreading function and a predefined operation, the spreading function being representable as a convolution of a first spreading function and a second spreading function, the first spreading function representing a different distribution than the second spreading function, the processing of the charge distribution comprising: applying the first spreading function in a real domain to determine charge values at locations on a grid from the charge distribution; applying the operation on the grid to the determined charge values on the grid in the real domain; applying the second spreading function to the result of applying the operation to generate data characterizing forces on the set of charged particles; and at each node, according to the generated data, updating the data for the corresponding sub-set of the set of particles within a region associated with the node.
 2. The method of claim 1 wherein the charge distribution includes a set of point charges.
 3. The method of claim 2 wherein each point charge of the set of point charges has an associated charge value (q_(i)) and an associated location (r_(i)).
 4. The method of claim 3 wherein at least some of the associated locations (r_(i)) are locations not on the grid.
 5. The method of claim 2 wherein applying the first spreading function in the real domain to determine charge values at locations on the grid from the charge distribution includes convolving the set of point charges with the first spreading function.
 6. The method of claim 5 wherein convolving the set of point charges with a first spreading function includes computing a distribution according to ρ(r){circle around (×)}S(r), where ρ(r)comprises the charge distribution and S(r) comprises the first spreading function.
 7. The method of claim 5 wherein convolving the set of point charges with the first spreading function includes, for each point charge, spreading a charge associated with the point charge to a set of nearby nodes.
 8. The method of claim 1 wherein applying the operation on the grid in the real domain includes computing a potential function.
 9. The method of claim 8 wherein computing the potential function includes computing a potential value at least some of the grid locations.
 10. The method of claim 1 wherein the operation includes a convolution.
 11. The method of claim 10 wherein the convolution includes a convolution with a 1/r function.
 12. The method of claim 1 wherein the operation comprises a solution of a Poisson function.
 13. The method of claim 1 wherein applying the first spreading function includes a convolution with a portion of the spreading function on the grid.
 14. The method of claim 1 wherein applying the operation includes computing a potential according to φ*(r)=ρ^(s)(r){circle around (×)}γ(r) where ρ^(s)(r) comprises the charge distribution and γ(r)is an operator.
 15. The method of claim 14 wherein γ(r) comprises a 1/r function.
 16. The method of claim 14 wherein at least some of the force terms are associated with non-grid locations.
 17. The method of claim 16 wherein the charge distribution includes a set of point charges at non-grid locations (r_(i)).
 18. The method of claim 17 wherein at least some of the force terms associated with non-grid locations are associated with the non-grid locations (r_(i)) associated with the point charges.
 19. The method of claim 1 wherein applying the second spreading function to the result of applying the operation generates at least some force terms.
 20. The method of claim 1 wherein applying the second spreading function to the result of applying the operation includes applying a spatial derivative to the result of applying the function.
 21. The method of claim 1 wherein applying the second spreading function to the result of applying the operation includes evaluating a spatial derivative at grid locations.
 22. The method of claim 21 wherein evaluating the spatial derivative includes applying the spatial derivative to the result of applying the operation on the grid.
 23. The method of claim 1 wherein applying the second spreading function to the result of applying the operation includes computing a potential energy.
 24. The method of claim 1 wherein the real domain comprises a real spatial domain.
 25. The method of claim 1 wherein the first spreading function is representable as a convolution of a first portion and a second portion, and wherein applying the first spreading function includes applying the first portion to determine charge values at grid locations and applying the second portion on the grid to the values at the grid locations determined by applying the first portion prior to applying the operation.
 26. The method of claim 25 further comprising implementing the second portion as a separable function.
 27. The method of claim 25 wherein splitting the first spreading function into the first portion and the second portion includes splitting the first spreading function into the first portion and the second portion based on computational complexity.
 28. The method of claim 25 wherein splitting the first spreading function into the first portion and the second portion includes splitting the first spreading function into the first portion and the second portion, the first portion being equal to the second portion.
 29. The method of claim 25 wherein splitting the first spreading function into the first portion and the second portion includes splitting the first spreading function into the first portion and the second portion, the first portion being unequal to the second portion.
 30. The method of claim 29 wherein the first portion is smaller than the second portion.
 31. The method of claim 29 wherein the first portion is selected according to an accuracy level for a force calculation.
 32. The method of claim 1 wherein applying the second spreading function to the result of applying the operation includes computing values at locations off the grid based on values at the grid locations.
 33. The method of claim 1 wherein the first spreading function and the second spreading function comprise Gaussian functions each having a different variance.
 34. The method of claim 1 in which the first spreading function comprises a Gaussian function.
 35. The method of claim 1 in which the second spreading function comprises a Gaussian function.
 36. A method comprising: using a computer system comprising a plurality of computing nodes, in which each node stores charge distribution data for a corresponding sub-set of a set of particles within a region associated with the node, processing data characterizing the charge distribution according to a spreading function and a predefined operation, the spreading function being representable as a convolution of a first spreading function and a second spreading function, the first spreading function being representable as a convolution of a first portion and a second portion, the second portion being a separable function, the processing comprising: applying the first portion of the first spreading function in a real domain to determine charge values at locations on a grid from the charge distribution; applying a second portion of the first spreading function in the real domain; applying an operation in the real domain on the grid; applying the second spreading function to the result of applying the operation; and at each node, updating the charge distribution data according to the result of applying the second spreading function.
 37. The method of claim 36 wherein the charge distribution includes a set of point charges.
 38. The method of claim 37 wherein the each point charge in the set of point charges has an associated charge value (q_(i)) and an associated location (r_(i)).
 39. The method of claim 38 wherein at least some of the associated locations (r_(i)) are locations not on the grid.
 40. The method of claim 38 wherein applying the first portion of the first spreading function in the real domain to determine charge values at locations on the grid from the charge distribution includes convolving the set of point charges with the first portion of the first spreading function.
 41. The method of claim 40 wherein convolving the set of point charges with the first portion of the first spreading function includes computing a distribution according to ρ(r){circle around (×)}S(r) where ρ(r) comprises the charge distribution and S(r) comprises the first portion of the first spreading function.
 42. The method of claim 41 wherein convolving the set of point charges with the first portion of the first spreading function includes, for each point charge, spreading a charge associated with the point charge to a set of nearby nodes or the gird.
 43. The method of claim 36 wherein applying the second portion of the first spreading function in the real domain includes applying the second portion of the first spreading function as a separable function.
 44. The method of claim 36 wherein applying the second potion of the first spreading function in the real domain includes implementing a discrete space convolution.
 45. The method of claim 36 wherein applying the second portion of the first spreading function spreads charges over the grid locations.
 46. The method of claim 36 wherein applying the operation on the grid in the real domain includes computing a potential function.
 47. The method of claim 46 wherein computing a potential function includes computing a potential function at the grid locations.
 48. The method of claim 46 wherein the convolution includes a convolution with a 1/r function.
 49. The method of claim 36 wherein the operation includes a convolution.
 50. The method of claim 36 wherein the operation comprises a solution of a Poisson function.
 51. The method of claim 36 wherein the operation includes a convolution with the second portion of the first spreading function.
 52. The method of claim 36 wherein applying the operation includes computing a potential according to φ*(r)=ρ^(s)(r){circle around (×)}γ(r), where ρ^(s)(r) comprises the charge distribution and γ(r) is an operator.
 53. The method of claim 52 wherein γ(r) comprises a 1/r function.
 54. The method of claim 36 wherein applying the second spreading function to the result of applying the operation generates at least some force terms.
 55. The method of claim 54 wherein at least some of the force terms are associated with non-grid locations.
 56. The method of claim 55 wherein the charge distribution includes a set of point charges at non-grid locations (r_(i)).
 57. The method of claim 56 wherein the force terms at non-grid locations are at the non-grid locations (r^(i)) associated with the point charges.
 58. The method of claim 36 wherein applying the second spreading function to the result of applying the operation includes a spatial derivative at grid locations.
 59. The method of claim 58 wherein evaluating the spatial derivative includes applying the spatial derivative to the result of applying the operation on the grid.
 60. The method of claim 36 wherein the real domain comprises a real spatial domain.
 61. The method of claim 36 wherein applying the second spreading function to the result of applying the operation includes computing values at locations off the grid based on values at the grid locations.
 62. The method of claim 36 wherein the first spreading function represents a different distribution than the second spreading function.
 63. The method of claim 62 wherein the first spreading function and the second spreading function comprise Gaussian functions each having a different variance.
 64. The method of claim 36 wherein the first spreading function comprises a Gaussian function.
 65. The method of claim 36 wherein the second spreading function comprises a Gaussian function.
 66. The method of claim 36 wherein the first portion is unequal to the second portion.
 67. The method of claim 36 wherein the first portion is smaller than the second portion.
 68. The method of claim 36 wherein the first portion comprises at least an amount of the first spreading function determined to maintain a specified accuracy level.
 69. The method of claim 36 wherein applying an operation in the real domain on the grid includes solving Poisson's equation.
 70. The method of claim 69 wherein solving Poisson's equation includes iteratively solving Poisson's equation.
 71. A method comprising: using a computer system comprising a plurality of computing nodes, in which each node stores data for a corresponding sub-set of a set of particles within a region associated with the node, processing a charge distribution according to a Gaussian spreading function, the Gaussian spreading function being a convolution of components, the processing including: spreading the charges to a grid in a first domain based on a first component of the Gaussian spreading function; applying a function to the charges on the grid in a second domain using a second component of the Gaussian spreading function; performing a calculation based on a third component of the Gaussian spreading function and the result of applying the function; and at each node, updating the data according to the result of performing the calculation based on the third component.
 72. The method of claim 71 wherein the charge distribution includes a set of point charges.
 73. The method of claim 72 wherein each point charge included in the set of point charges has an associated charge value (q_(i)) and an associated location (r_(i)).
 74. The method of claim 73 wherein at least some of the associated locations (r_(i)) are locations not on the grid.
 75. The method of claim 72 wherein spreading the charges to the grid includes convolving the set of point charges with the first component of the spreading function.
 76. The method of claim 75 wherein convolving the set of point charges with the first component of the spreading function includes computing a distribution according to ρ(r){circle around (×)}S(r) where ρ(r) comprises the charge distribution and S(r) comprises the first component of the spreading function.
 77. The method of claim 75 wherein convolving the set of point charges with the first component of the spreading function includes, for each point charge, spreading the charge to a set of nearby nodes.
 78. The method of claim 71 wherein applying the function to the charges on the grid in a second domain using a second component of the Gaussian spreading function includes applying the second component of the spreading function as a separable function.
 79. The method of claim 71 wherein applying the second component of the spreading function in the second domain includes implementing a discrete space convolution.
 80. The method of claim 71 wherein applying the function to the charges on the grid in the second domain using the second component of the Gaussian spreading function spreads charges over the grid locations.
 81. The method of claim 71 wherein applying the function to the charges on the grid in the second domain includes computing a potential function.
 82. The method of claim 81 wherein computing the potential function includes computing the potential function at the grid locations.
 83. The method of claim 71 wherein the operation includes a convolution.
 84. The method of claim 83 wherein the convolution includes a convolution with a 1/r function.
 85. The method of claim 71 wherein the operation comprises a solution of a Poisson function.
 86. The method of claim 71 wherein the operation includes a convolution with a second portion of the first spreading function.
 87. The method of claim 71 wherein applying the operation includes computing a potential according to φ*(r)=ρ^(s)(r){circle around (×)}γ(r) where ρ^(s)(r) comprises the charge distribution and γ(r) is an operator.
 88. The method of claim 87 where in γ(r) comprises a 1/r function.
 89. The method of claim 71 wherein performing the calculation based on a third component of the Gaussian spreading function and the result of applying the function generates at least some force terms.
 90. The method of claim 89 wherein at least some of the force terms are associated with non-grid locations.
 91. The method of claim 90 wherein the charge distribution includes a set of point charges at non-grid locations (r_(i)).
 92. The method of claim 91 wherein the force terms at non-grid locations are at the non-grid locations (r_(i)) associated with the point charges.
 93. The method of claim 92 wherein applying the second spreading function to the result of applying the operation includes evaluating a spatial derivative at grid locations.
 94. The method of claim 93 wherein evaluating the spatial derivative includes applying the spatial derivative to the result of applying the operation on the grid.
 95. The method of 71 wherein performing the calculation based on a third component of the Gaussian and the result of applying the function includes implementing a convolution of the result with the third component.
 96. The method of claim 71 wherein the first component of the Gaussian spreading function, the second portion of the Gaussian spreading function, and the third portion of the Gaussian spreading function each represent different Gaussian distributions.
 97. The method of claim 71 wherein the first domain is a real domain.
 98. The method of claim 71 wherein the second domain is an FFT domain.
 99. The method of claim 71 wherein applying the function to the charges on the grid in the second domain using the second component of the Gaussian spreading function includes convolving the function with the second portion of the Gaussian spreading function.
 100. The method of claim 99 wherein convolving the function with the second portion of the Gaussian spreading function includes multiplying the function with the second portion of the Gaussian spreading function in the FFT domain.
 101. The method of claim 71 wherein performing the calculation includes calculating a force.
 102. The method of claim 71 wherein the charge distribution comprises a charge distribution representing a protein.
 103. A machine-based method comprising: selecting a first distribution, a second distribution, and a third distribution such that a convolution of the first distribution, the second distribution, and the third distribution is equal to a predefined spreading function; using a computer system comprising a plurality of computing nodes, in which each node stores data for a corresponding sub-set of a set of particles within a region associated with the node, determining forces on a particle associated with charges based on applying the first distribution and the second distribution in a first computational domain and applying the third distribution in a second computational domain; and storing data characterizing the determined forces on the particle at a corresponding node.
 104. The method of claim 103 wherein determining forces on the particle associated with the charges includes computing charge values at grid locations.
 105. The method of claim 104 wherein determining forces on the particle associated with the charges further comprises computing potentials at non-grid locations.
 106. The method of claim 104 wherein determining forces on the particle associated with the charges further comprises computing force terms at grid locations.
 107. The method of claim 103 wherein applying the third distribution includes applying the third distribution in combination with an operation to the spread charge.
 108. The method of claim 103 wherein the first distribution, the second distribution, and the third distribution are Gaussian functions.
 109. The method of claim 103 wherein selecting includes selecting the first distribution, the second distribution, and the third distribution based on an acceptable amount of error.
 110. The method of claim 103 wherein determining the forces includes a convolution with a 1/r function.
 111. The method of claim 103 wherein determining the forces comprises a solution of a Poisson function.
 112. The method of claim 103 wherein applying the first distribution and the second distribution in a first computational domain includes convolving at least one of the first distribution and the second distribution with the charge distribution.
 113. The method of claim 103 wherein applying the third distribution in a second computational domain includes convolving the third distribution with a set of charges located at grid locations.
 114. The method of claim 103 wherein the first domain is a real domain.
 115. The method of claim 103 wherein the second domain is a FFT domain. 